Sorting on Reconfigurable Meshes: An Irregular Decomposition Approach

Hierarchical Decomposition of Datasets on Irregular Surface Meshes

In this paper we introduce multiresolution analysis (MRA) algorithms intended to be used in scientific visualization, and based on a non-nested set of approximatingspaces. The need for non nested spaces arises from the fact that the required scaling functions do not fulfill any refinement equation. Therefore we introduce in the first part the concept of approximated refinement equation, that al...

Visibility Computation on Reconfigurable Meshes

Visibility problems are investigated using reconngurable meshes. A set of algorithms are proposed on the architecture for visibility computation in two and three dimensions. We show that visibility of a total of n disjoint edges in the plane can be computed in O(1) time on an n n mesh. The result is optimal in the word model of VLSI. For the case that the edges are not disjoint, the problem is ...

Optimal Algorithms on Reconfigurable Meshes

Row-Major Sorting on Meshes

In all recent near-optimal sorting algorithms for meshes, the packets are sorted with respect to some snake-like indexing. In this paper we present deterministic algorithms for sorting with respect to the more natural row-major indexing. For 1-1 sorting on an n n mesh, we give an algorithm that runs in 2 n+ o(n) steps, matching the distance bound, with maximal queue size five. It is considerabl...

Processing Irregular Meshes

Most meshes are usually produced with both topological and geometrical irregularity (arbitrary valence, non-uniform sampling). This has been seen as a flaw hindering subsequent mesh processing, because most of the other signals we manipulate everyday (sound, image, video) are acquired and processed as regularly sampled data. Three-dimensional (3D) signals, be they surfaces or volumes, are howev...